A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets
نویسندگان
چکیده
A data structure is said to be succinct if it uses an amount of space that is close to the informationtheoretic lower bound, but still allows for efficient query processing. Quadtrees are among the most widely used data structures for answering queries on point sets in Euclidean space. In this paper we present a succinct quadtree structure. Our data structure can efficiently answer approximate range queries and approximate nearest neighbor queries and supports insertion and deletion of points.
منابع مشابه
Orthant neighborhood graphs - a decentralized approach for proximity queries in dynamic point sets
This work presents a novel approach for proximity queries in dynamic point sets, a common problem in computer graphics. We introduce the notion of Orthant Neighborhood Graphs, yielding a simple, decentralized spatial data structure based on weak spanners. We present efficient algorithms for dynamic insertions, deletions and movements of points, as well as range searching and other proximity que...
متن کاملThe Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets
This work presents a novel approach for proximity queries in dynamic point sets, a common problem in computer graphics. We introduce the notion of Orthant Neighborhood Graphs, yielding a simple, decentralized spatial data structure based on weak spanners. We present efficient algorithms for dynamic insertions, deletions and movements of points, as well as range searching and other proximity que...
متن کاملA Space-Efficient Framework for Dynamic Point Location
Let G be a planar subdivision with n vertices. A succinct geometric index for G is a data structure that occupies o(n) bits beyond the space required to store the coordinates of the vertices of G, while supporting efficient queries. We describe a general framework for converting dynamic data structures for planar point location into succinct geometric indexes, provided that the subdivision G to...
متن کاملارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملSuccinct and Implicit Data Structures for Computational Geometry
Many classic data structures have been proposed to support geometric queries, such as range search, point location and nearest neighbor search. For a two-dimensional geometric data set consisting of n elements, these structures typically require O(n), close to O(n) or O(n lg n) words of space; while they support efficient queries, their storage costs are often much larger than the space require...
متن کامل